Parallel Generation of t-ary Trees
نویسندگان: ثبت نشده
چکیده مقاله:
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time complexity, and ranking and unranking algorithms with O(t n) time complexity is also given.
Download for Free
Sign up for free to access the full text
Sign up - It's Free!اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودمنابع مشابه
parallel generation of t-ary trees
a parallel algorithm for generating t-ary tree sequences in reverse b-order is presented. the algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time o(1). the algorithm is executed on a crew sm simd model, and is adaptive and cost-optimal. prior to the discussion of the parallel algorithm a new sequential generation with o(1) average time ...
متن کاملParallel Generation of t-Ary Trees in A-order
We present a cost-optimal and adaptive parallel algorithm for generating t-ary trees in A-order. The generation is based on an encoding using integer sequences (z-sequences) due to Zaks [(1980), Lexicographic generation of ordered tree. Theor. Comput. Sci., 10, 63–82]. Our algorithm is the first introduced parallel generation algorithm, which generates t-ary trees in A-order in the literature. ...
متن کاملParallel Enumeration of t–ary Trees in ASC SIMD Model
In this paper parallel algorithms are presented for enumeration and unranking of t–ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC that belongs to a broad category of SIMD models. Tree sequences are generated in lexicographical order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted gr...
متن کاملOn Parallel Generation of t-Ary Trees in an Associative Model
In this paper a new parallel algorithm is presented for generation of t–ary trees. Computations run in an associative processor model. Tree sequences are generated in lexicographic order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted growth. The corresponding full t–ary trees (x–sequences) appear in antilexicographic order.
متن کاملA Parallel Dynamic Programming Algorithm for Unranking t-ary Trees
In this paper an O(n) parallel algorithm is presented for fast unranking t–ary trees with n internal nodes in Zaks’ representation. A sequential O(nt) algorithm is derived on the basis of dynamic programming paradigm. In the parallel version of the algorithm processing is performed in a dedicated parallel architecture containing certain systolic and associative features. At first a coefficient ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 16 شماره 2
صفحات -
تاریخ انتشار 2005-06-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023